منابع مشابه
Towards Efficient Graph Traversal using a Multi-GPU Cluster
Graph processing has always been a challenge, as there are inherent complexities in it. These include scalability to larger data sets and clusters, dependencies between vertices in the graph, irregular memory accesses during processing and traversals, minimal locality of reference, etc. In literature, there are several implementations for parallel graph processing on single GPU systems but only...
متن کاملA Power Characterization and Management of GPU Graph Traversal
Graph analysis is a fundamental building block in numerous computing domains. Recent research has looked into harnessing GPUs to achieve necessary throughput goals. However, comparatively little attention has been paid to improving the power-constrained performance of these applications. Through firmware changes on a state-of-the-art commodity GPU, we characterize the power consumption of Bread...
متن کاملUnderstanding the SIMD Efficiency of Graph Traversal on GPU
Graph is a widely used data structure and graph algorithms, such as breadth-first search (BFS), are regarded as key components in a great number of applications. Recent studies have attempted to accelerate graph algorithms on highly parallel graphics processing unit (GPU). Although many graph algorithms based on large graphs exhibit abundant parallelism, their performance on GPU still faces for...
متن کاملEnergy-Efficient Graph Traversal on Integrated CPU-GPU Architectures
Recently, architecture designers tend to integrate CPUs and raphics Processing Units(GPUs) on the same chip to produce energy-efficient designs. On the other hand, graph applications are becoming increasingly important for big data analysis. Among the graph analysis algorithms, BreadthFirst Search (BFS) is the most representative one and also an important building block for other algorithms. De...
متن کاملUsing Graph Properties to Speed-up GPU-based Graph Traversal: A Model-driven Approach
While it is well-known and acknowledged that the performance of graph algorithms is heavily dependent on the input data, there has been surprisingly little research to quantify and predict the impact the graph structure has on performance. Parallel graph algorithms, running on many-core systems such as GPUs, are no exception: most research has focused on how to efficiently implement and tune di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2012
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2370036.2145832